Informed RRT*-Connect: An Asymptotically Optimal Single-Query Path Planning Method
نویسندگان
چکیده
منابع مشابه
RRT-Connect: An Efficient Approach to Single-Query Path Planning
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementally building two Rapidly-exploring Random Trees (RRTs) rooted at the start and the goal configurations. The trees each explore space around them and also advance towards each other through the use of a simple greedy heur...
متن کاملInformed Sampling for Asymptotically Optimal Path Planning
Anytime almost-surely asymptotically optimal planners, such as RRT*, incrementally find paths to every state in the search domain. This is inefficient once an initial solution is found as then only states that can provide a better solution need to be considered. Exact knowledge of these states requires solving the problem but can be approximated with heuristics. This paper formally defines thes...
متن کاملMulti-vehicle planning using RRT-connect
The problem of planning multiple vehicles deals with the design of an effective algorithm that can cause multiple autonomous vehicles on the road to communicate and generate a collaborative optimal travel plan. Our modelling of the problem considers vehicles to vary greatly in terms of both size and speed, which makes it suboptimal to have a faster vehicle follow a slower vehicle or for vehicle...
متن کاملAsymptotically-optimal Path Planning on Manifolds
This paper presents an approach for optimal path planning on implicitly-defined configuration spaces such as those arising, for instance, when manipulating an object with two arms or with a multifingered hand. In this kind of situations, the kinematic and contact constraints induce configuration spaces that are manifolds embedded in higher dimensional ambient spaces. Existing sampling-based app...
متن کاملEfficient asymptotically-optimal path planning on manifolds
This paper presents an efficient approach for asymptotically-optimal path planning on implicitly-defined configuration spaces. Recently, several asymptotically-optimal path planners have been introduced, but they typically exhibit slow convergence rates. Moreover, these planners can not operate on the configuration spaces that appear in the presence of kinematic or contact constraints, such as ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2020
ISSN: 2169-3536
DOI: 10.1109/access.2020.2969316